Heavy-traffic limits for server idle times with customary server-assignment rules
نویسنده
چکیده
Sun and Whitt (2017) developed a class of server-assignment rules that can help create effective breaks for servers from naturally available idleness. They found that the standard longest-idle-server-first rule and the alternative random routing generate breaks too infrequently. This paper provides theoretical justifications for these empirical findings by establishing the many-server heavy-traffic limits for server idle times with customary assignment rules. We gain insights into the server idle–busy activity patterns resulting from the server-assignment schemes in the system. © 2017 Elsevier B.V. All rights reserved.
منابع مشابه
Appendix to Creating Work Breaks From Available Idleness
We show how dynamic priority (DP) rules for assigning available service representatives to arriving customers in customer contact centers can be used to create effective work breaks for the service representatives from naturally available idleness, assuming that the service system is staffed adequately to provide non-negligible idleness. We start by establishing many-server heavy-traffic limits...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملSingle Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...
متن کاملA New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...
متن کاملHeavy Traffic Limits for Unobservable Queues with Clearing Times
In many service systems, customers may choose to abandon the system if their wait is deemed excessive. In an observable queue, the server is always aware that an abandoning customer has left the queue. However, in unobservable queues, the fact that the customer has abandoned the system may be unbeknownst to the server. Not only are the abandoning customers unobservable to the server, the server...
متن کامل